Promise Problems and Access to Unambiguous Computation
نویسندگان
چکیده
Query complexity, or why is it dicult to separate NP A T coNP A from P A by random oracles A. 24 as a result of an exhaustive search, thus x 6 2 L; hence M is a robust machine accepting L. Now suppose x 2 L and the promise problem A dened above is used as the oracle. We show that x is accepted in polynomial time.
منابع مشابه
Unambiguous Computations and Locally Deenable Acceptance Types: Expanded Version
Hertrampf's locally de nable acceptance types show that many complexity classes can be de ned in terms of polynomial time bounded NTM's with simple local conditions on the nodes of its computation tree, rather than global concepts like number of accepting paths etc. We introduce a modi cation of Hertrampf's locally de nable acceptance types which allows to get a larger number of characterizable...
متن کاملUnambiguous Computations and Locally Deenable Acceptance Types
Hertrampf's locally de nable acceptance types show that many complexity classes can be de ned in terms of polynomial time bounded NTM's with simple local conditions on the nodes of its computation tree, rather than global concepts like number of accepting paths etc. We introduce a modi cation of Hertrampf's locally de nable acceptance types which allows to get a larger number of characterizable...
متن کاملUnambiguous Computations and Locally Definable Acceptance Types
Hertrampf’s locally definable acceptance types show that many complexity classes can be defined in terms of polynomial time bounded NTM’s with simple local conditions on the nodes of its computation tree, rather than global concepts like number of accepting paths etc. We introduce a modification of Hertrampf’s locally definable acceptance types which allows to get a larger number of characteriz...
متن کاملar X iv : c s . C C / 0 70 20 47 v 1 8 Fe b 20 07 Hierarchical Unambiguity ∗
We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and Promise-UP) to new constructs involving arbitrary higher levels of the relativized unambiguous polynomial hierarchy (UPH). Our techniques are developed on constraints imposed by hierarchic...
متن کاملExtended Locally Deenable Acceptance Types
Hertrampf's locally deenable acceptance types showed that many complexity classes can be deened in terms of polynomially time bounded NTM's with simple local conditions on the nodes of its computation tree, rather than global concepts like number of accepting paths etc. We introduce extended locally deenable acceptance types as a generalization of Hertrampf's concept in order to formally captur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992